A Hybrid Genetic Algorithm for RNA Structural Alignment
نویسندگان
چکیده
منابع مشابه
A Parallel Hybrid Genetic Algorithm for Multiple Protein Sequence Alignment
This paper presents a parallel hybrid genetic algorithm (GA) for solving the sum-of-pairs multiple protein sequence alignment. The method is based on a multiple population GENITOR-type GA and involves local search heuristics. It is then extended to parallel to exploit the benefit of multiprocessor system. Benchmarks from the BAliBASE library are used to validate the method.
متن کاملRAGA: RNA sequence alignment by genetic algorithm.
We describe a new approach for accurately aligning two homologous RNA sequences when the secondary structure of one of them is known. To do so we developed two software packages, called RAGA and PRAGA, which use a genetic algorithm approach to optimize the alignments. RAGA is mainly an extension of SAGA, an earlier package for multiple protein sequence alignment. In PRAGA several genetic algori...
متن کاملA Hybrid Genetic Algorithm for Structural Optimization Problems
This paper presents a hybrid optimization algorithm based on a modified genetic algorithm (GA). The algorithm includes two stages. In the first stage, a global search is carried out over the design search space using a modified GA. In the second stage, a local search is executed that is based on GA solution using a discretized form of Hooke and Jeeves method. The modifications on basic GA inclu...
متن کاملRNA Sampler: a new sampling based algorithm for common RNA secondary structure prediction and structural alignment
MOTIVATION Non-coding RNA genes and RNA structural regulatory motifs play important roles in gene regulation and other cellular functions. They are often characterized by specific secondary structures that are critical to their functions and are often conserved in phylogenetically or functionally related sequences. Predicting common RNA secondary structures in multiple unaligned sequences remai...
متن کاملA HYBRID GENETIC ALGORITHM FOR A BI-OBJECTIVE SCHEDULING PROBLEM IN A FLEXIBLE MANUFACTURING CELL
This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2011
ISSN: 0975-8887
DOI: 10.5120/2370-3120